a comparison of direct and indirect regularization methods for downward continuation problem of geoid computations without applying stokes formula

the problem of downward continuation of the gravity field from the earth’s surface to the reference ellipsoid arises from the fact that the solution to the boundary value problem for geoid determination without applying stokes formula is sought in terms of the disturbing potential on the ellipsoid but the disturbing gravity observations are only available on the earth’s surface. downward continuation is achieved via abel-poisson integral and its derivatives. using discrete observations, the abel-poisson integral has to be transformed into a summation form: (1) where the matrix is the design matrix and stands for the disturbing gravity observations vector. the downward continuation problem is an inverse problem. inverse problems are ill-posed, like any ill-posed problem it must be regularized. the objective of this paper is the comparison between direct and iterative methods for solving downward continuation of the gravity field from the earth’s surface to the reference ellipsoid for geoid determination without applying stokes formula. direct regularization methods are methods where the solution is directly derived. in this contribution truncated method, standard tikhonov method and generalized tikhonov method using discretized norms at sobolov subspaces , and sobolov semi norms and are implemented. based on svd, in truncated methods, the solution can be obtained as: (2) where and are the right and the left singular vectors, respectively. is rank of matrix that is a l2 norm approximation for matrix . in the case of tgsvd the solution is obtained as (3) in standard tikhonov method, the minimizing function can be written as: (4) in this method, filter coefficients and solution become: (5) in standard tikhonov method, the matrix was . in generalized tikhonov method, we select the matrix as follows (6) where the is obtained from discretization of derivative operators up to order s and coefficients are weight coefficients. in contrast to direct methods, in iterative methods, normal equations are solved via construction of a sequence of the solutions that converge to the pseudo-inverse solution of the equations. in this contribution classical iterative method, landweber-fridman method, tikhonov iterative method, algebraic reconstruction technique (art), conjugate gradient method and lsqr method are implemented. classical iterative methods are based on construction of sequences of solutions . for the matrix equation , the following relationship holds between solution and solution : (7) in landweber-fridman method the matrix is equal to diagonal matrix . ergo, in this method, iterative relation between the solutions is defined as: (8) in tikhonov iterative method, iterative relation between the solutions is defined as: (9) the idea of algebraic reconstruction technique iteration to solve the matrix equation is to partition the system row wise, either into single rows or into blocks of rows. each of these rows defines a hyper plane of dimension . the idea of the art iteration is to project the current approximate solution successively onto each one these hyper planes. it turns out that such a procedure converges to the solution of the system. a best known method for solving large scale equations system is conjugate gradient. conjugate gradient is a type of krylov subspace method. conjugate gradient method is suitable for positive definite operators. in lsqr method, solution vector is def